Estimation of a k−monotone density, part 3: limiting Gaussian versions of the problem; invelopes and envelopes

نویسندگان

  • Fadoua Balabdaoui
  • Jon A. Wellner
چکیده

Let k be a positive integer. The limiting distribution of the nonparametric maximum likelihood estimator of a k−monotone density is given in terms of a smooth stochastic process Hk described as follows: (i) Hk is everywhere above (or below) Yk, the k− 1 fold integral of two-sided standard Brownian motion plus (k!/(2k)!)t2k when k is even (or odd). (ii) H(2k−2) k is convex. (iii) Hk touches Yk at exactly those points where H(2k−2) k has changes of slope. We show that Hk exists if a certain conjecture concerning a particular Hermite interpolation problem holds. The process H1 is the familiar greatest convex minorant of two-sided Brownian motion plus (1/2)t2, which arises in connection with nonparametric estimation of a monotone (1-monotone) function. The process H2 is the “invelope process” studied in connection with nonparametric estimation of convex functions (up to a scaling of the drift term) in Groeneboom, Jongbloed, and Wellner (2001a). We therefore refer to Hk as an “invelope process” when k is even, and as an “envelope process” when k is odd. We establish existence of Hk for all non-negative integers k under the assumption that our key conjecture holds, and study basic properties of Hk and its derivatives. Approximate computation of Hk is possible on finite intervals via the iterative (2k−1) spline algorithm which we use here to illustrate the theoretical results. 1 Research supported in part by National Science Foundation grant DMS-0203320 2 Research supported in part by National Science Foundation grants DMS-0203320, and NIAID grant 2R01 AI291968-04 AMS 2000 subject classifications. Primary: 62G05; secondary 60G15, 62E20.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Estimation of a k-monotone density, part 2: algorithms for computation and numerical results

The iterative (2k − 1)−spline algorithm is an extension of the iterative cubic spline algorithm developed and used by Groeneboom, Jongbloed, and Wellner (2001b) to compute the Least Squares Estimator (LSE) of a nonincreasing and convex density on (0,∞), and to find an approximation of the “invelope” of the integrated two-sided Brownian motion+t4 that is involved in the limiting distribution of ...

متن کامل

A Berry-Esseen Type Bound for a Smoothed Version of Grenander Estimator

In various statistical model, such as density estimation and estimation of regression curves or hazard rates, monotonicity constraints can arise naturally. A frequently encountered problem in nonparametric statistics is to estimate a monotone density function f on a compact interval. A known estimator for density function of f under the restriction that f is decreasing, is Grenander estimator, ...

متن کامل

Estimation of a K − Monotone Density , Part 1 : Characterizations , Consistency , and Minimax Lower

Shape constrained densities are encountered in many nonparametric estimation problems. The classes of monotone or convex (and monotone) densities can be viewed as special cases of the classes of k−monotone densities. A density g is said to be k−monotone if (−1)g is nonnegative, nonincreasing and convex for l = 0, . . . , k−2 if k ≥ 2, and g is simply nonincreasing if k = 1. These classes of sha...

متن کامل

Application of adaptive sampling in fishery part 1: Adaptive cluster sampling and its strip designs

Abstract:  The precision of conventional sampling designs is not usually satisfactory for estimating parameters of clump and rare populations. Many of fish species live in school and disperse all over a vast area like a sea so that they are rare compare to their habitats. Theory of a class of sampling designs called adaptive sampling designs has rapidly grown during last decade which solved the...

متن کامل

Presentation of K Nearest Neighbor Gaussian Interpolation and comparing it with Fuzzy Interpolation in Speech Recognition

Hidden Markov Model is a popular statisical method that is used in continious and discrete speech recognition. The probability density function of observation vectors in each state is estimated with discrete density or continious density modeling. The performance (in correct word recognition rate) of continious density is higher than discrete density HMM, but its computation complexity is very ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004